Alternating-time temporal logic with finite-memory strategies
نویسندگان
چکیده
منابع مشابه
Alternating-time temporal logic with finite-memory strategies
Model-checking the alternating-time temporal logics AT L and AT L∗ with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed is bounded and one where the memory ...
متن کاملAlternating-time Temporal Logic with Explicit Programs
We introduce ATLEP, an extension of Alternating-time Temporal Logic (ATL), following the recent Alternating-time Temporal Logic with Explicit Actions (ATLEA). ATLEP adds to the language of ATL explicit programs whose agents are committed to play, formulated in an extension of Propositional Dynamic Logic (PDL) where strategies can be captured. We add combinations of commitments, inspired from th...
متن کاملAlternating-time temporal logic with resource bounds
Many problems in AI and multi-agent systems research are most naturally formulated in terms of the abilities of a coalition of agents. There exist several excellent logical tools for reasoning about coalitional ability. However, coalitional ability can be affected by the availability of resources, and there is no straightforward way of reasoning about resource requirements in logics such as Coa...
متن کاملGraded Alternating-Time Temporal Logic
Recently, graded modalities have been added to the semantics of two of the logics most commonly used by the computer science community: μ-calculus, in [KSV02], and Ctl in [FNP08]. In both these settings, graded modalities enrich the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a non-negative integer k. Both μ-calculus and Ctl n...
متن کاملTimed Alternating-Time Temporal Logic
We add freeze quantifiers to the game logic ATL in order to specify real-time objectives for games played on timed structures. We define the semantics of the resulting logic TATL by restricting the players to physically meaningful strategies, which do not prevent time from diverging. We show that TATL can be model checked over timed automaton games. We also specify timed optimization problems f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2013
ISSN: 2075-2180
DOI: 10.4204/eptcs.119.17